A parity-based Frege proof for the symmetric pigeonhole principle.
نویسندگان
چکیده
منابع مشابه
A Generalized Resolution Proof Schema and the Pigeonhole Principle
The schematic CERES method is a method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent the addition of an induction rule to the LK-calculus. In this work, we formalize a schematic version of the Infinitary Pigeonhole Principle (IPP), in the LKS-calculus [9], and analyse the extracted claus...
متن کاملAn Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
We prove lower bounds of the form exp (n " d) ; " d > 0; on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d; for any constant d: This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.
متن کاملAn Exponential Separation Between the Parity Principle and the Pigeonhole Principle
The combinatorial parity principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the parity principle requires exponentialsize bounded-d...
متن کاملThe Pigeonhole Principle
Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13 people there are two who have their birthdays in the same month. Example 1.2. There are n married couples. How many of the 2n people must be selected in order to guarantee that one has selected a married couple? Other principles related to the pigeonhole ...
متن کاملThe Topological Pigeonhole Principle for Ordinals
Given a cardinal κ and a sequence (αi )i∈κ of ordinals, we determine the least ordinal (when one exists) such that the topological partition relation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1993
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093633908